翻訳と辞書 |
Richard Statman : ウィキペディア英語版 | Richard Statman
Richard Statman is an American computer scientist whose principal research interest is the theory of computation, especially symbolic computation. His research involves lambda calculus, type theory and combinatory algebra. ==Career== In 1974, Statman received his Ph.D. from Stanford University for his Ph.D dissertation, supervised by Georg Kreisel, entitled ''Structural Complexity of Proofs''. His achievements include the proof that type inhabitation problem in simply typed lambda calculus is PSPACE-complete.
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Richard Statman」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|